Fine Grain Parallelisation of Functional Programs for VLIW or Super-scalar Architectures

This paper presents a compaction method of functional programs (eg, ML programs) for super-scalars or VLIW architectures. It is a generalisation of the Percolation scheduling system 1] and Perfect Pipelining 2]. It is described by a set of program transformations respecting data-dependences. Instead of managing a control-ow based representation of programs, the compaction is directly applied to functional expressions. It leads to a simple expression of compaction with direct renaming and an eecient implementation. It greedily realizes local and global compaction. The software pipelining principle, initially applied to loops, is extended to general recursive functions. To our knowledge, it is the rst method to compact a functional language.